FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure

FDPLL — A First-Order Davis-Putnam-Logeman-Loveland Procedure

FDPLL is a directly lifted version of the well-known DavisPutnam-Logeman-Loveland (DPLL) procedure. While DPLL is based on a splitting rule for case analysis wrt. ground and complementary literals, FDPLL uses a lifted splitting rule, i.e. the case analysis is made wrt. non-ground and complementary literals now. The motivation for this lifting is to bring together successful first-order techniqu...

A First-Order Logic Davis-Putnam-Logemann-Loveland Procedure

The Davis-Putnam-Logemann-Loveland procedure (DPLL) was introduced in the early 60s as a proof procedure for first-order logic. Nowadays, only its propositional logic core component is widely used in efficient propositional logic provers and respective applications. This success motivates to reconsider lifting DPLL to the first-order logic level in a more contemporary way, by exploiting success...

Simpliication with Renaming: a General Proof Technique for Tableau and Sequent-based Provers

Tableau and sequent calculi are the basis for most popular interactive theorem provers for hardware and software veri cation. Yet, when it comes to decision procedures or automatic proof search, tableaux are orders of magnitude slower than Davis-Putnam, SAT based procedures or other techniques based on resolution. To meet this challenge, this paper proposes a theoretical innovation: the rule of...

Theory decision by decomposition

The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formula in such a way that its definitional part, including the theory, can be compiled by a rewrite-based firstorder theorem prover, and the residual problem can be decided by an SMT-solver, based on the Davis-Putnam-Logemann...

Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: a large deviation Analysis Of The . . .